PSDM: An E cient Parallel Software Design Model
نویسندگان
چکیده
We present in this paper a parallel software design approach for developing synchronous and deterministic parallel applications. The approach is supported by a graph-ical design model (called PSDM) which serves as a visualization tool for representing and analyzing the application design prior to implementation. The main advantage in using the model is that it identiies clearly the time spent idling, computing, and communicating in parallel processes, thus allowing the software designer to optimize the required resources and runtime of the application at the design stage. The use of the design approach and its associated model is demonstrated by optimizing tree-based, pipeline-based, and ring-based communication functions. These optimized functions are in turn used to achieve better performance than that of the most recently reported balanced parallel quicksort and pipelined matrix multiplication. We also implemented parallel matrix triangularization on a ring with satisfactory eeciency.
منابع مشابه
Discrete-event simulation on the bulk-synchronous parallel model
The bulk-synchronous parallel (BSP) model of computing has been proposed to enable the development of portable software which achieves scalable performance across diverse parallel architectures. A number of applications of computing science have been demonstrated to be e ciently supported by the BSP model in practice. In this thesis we study the e cient realisation of parallel discrete-event si...
متن کاملSupporting parallel computing on a distributed object architecture
The availability of high-speed networks and increasingly powerful commodity microprocessors is making the usage of clusters, or networks, of computers an appealing platform for cost eective parallel computing. However, the ease of developing ecient high-performance parallel software to exploit these platforms presents a major challenge. Advances in distributed object software technology have ...
متن کاملParallel computation of pseudospectra by fast descent q
The pseudospectrum descent method (PsDM) is proposed, a new parallel method for the computation of pseudospectra. The idea behind the method is to use points from an already existing pseudospectrum level curve oK to generate in parallel the points of a new level curve oKd such that d < . This process can be continued for several steps to approximate several pseudospectrum level curves lying ins...
متن کاملMaisie: A Language for the Design of Efficient Discrete-Event Simulations
Maisie is a C-based discrete-event simulation language that was designed to cleanly separate a simulation model from the underlying algorithm (sequential or parallel) used for the execution of the model. With few modi cations, a Maisie program may be executed using a sequential simulation algorithm, a parallel conservative algorithm or a parallel optimistic algorithm. The language constructs al...
متن کاملThe design and analysis of bulk-synchronous parallel algorithms
The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. This thesis presents a systematic approach to the design and analysis of BSP algorithms. We introduce an extension of the BSP model, called BSPRAM, which reconciles shared-memory style programming with e cient exploitation of data locality. The BSPRAM model can be optimally si...
متن کامل